An exponential lower bound for Cunningham’s rule
نویسندگان
چکیده
منابع مشابه
An exponential lower bound for Cunningham's rule
In this paper we give an exponential lower bound for Cunningham’s least recently considered (round-robin) rule as applied to parity games, Markhov decision processes and linear programs. This improves a recent subexponential bound of Friedmann for this rule on these problems. The round-robin rule fixes a cyclical order of the variables and chooses the next pivot variable starting from the previ...
متن کاملAn Exponential Lower Bound for the Pure Literal Rule
A pure literal is a literal in a logic formula (usually in Conjunctive Normal Form) that occurs only positively or only negatively. The Davis-Putnam Procedure [l] was developed to find one solution to a logic formula, and it contains several techniques for speeding up the typical solution time. One of these techniques is the pure literal rule: a variable that occurs only positively or only nega...
متن کاملAn Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Haken proved that every resolution refutation of the pigeon hole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeon hole formula has an exponential size. Here we show that any arbitrary OBDD refutation of the pigeon hole formula has an exponential size, too: we prove that the size of one of the intermediate OBDDs is at least Ω(1.025).
متن کاملAn Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
Given an edge-weighted graph G with a set Q of k terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the sizes of minimum cuts between any partition of the terminals. A natural question in the area of graph compression is to provide as small mimicking networks as possible for input graph G being either an arbitrary graph or coming from a specific grap...
متن کاملConstruction of an NP Problem with an Exponential Lower Bound
In this paper we present a Hashed-Path Traveling Salesperson Problem (HPTSP), a new type of problem which has the interesting property of having no polynomial time solutions. Next we show that HPTSP is in the class NP by demonstrating that local information about subroutes is insufficient to compute the complete value of each route. As a consequence, via Ladner’s theorem, we show that the class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-016-1008-4